Heuristics for Safety and Security Constraints
نویسندگان
چکیده
منابع مشابه
Heuristics for Safety and Security Constraints
The flow logic approach to static analysis amounts to specifying the admissibility of solutions to analysis problems; when specified using formulae in stratified alternation-free least fixed point logic one may use efficient algorithms for computing the least admissible solutions. We extend this scenario to validate the fulfilment of safety and security constraints on admissible solutions; the ...
متن کاملTowards Combined Safety and Security Constraints Analysis
A growing threat to the cyber-security of embedded safety-critical systems calls for a new look at the development methods for such systems. One alternative to address security and safety concerns jointly is to use the perspective of modeling using system theory. Systems-Theoretic Process Analysis (STPA) is a new hazard analysis technique based on an accident causality model. NIST SP 800-30 is ...
متن کاملHeuristics and Biases: Implications for Security
How can heuristics and biases improve the design of security technologies to leverage end-user behaviors? This position paper argues both for the importance of this question, and the specific identified examples. We discuss the limitations and criticisms of a heuristics and biases approach to understanding human behavior. We introduce some emerging theories in social-psychology that are more qu...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملHeuristics for Integer Programming Using Surrogate Constraints
This paper proposes a class of surrogate constraint heuristics for obtaining approximate, 'near optimal solutions to integer programming problems. These heuris· tics are based on a simple framework that illuminates the character of several carlier heuristic proposals and provides a variety of new alternatives. The paper also pro· poses additional heuristics that can be used either to supplement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.02.018